Modulus of continuity

Results: 32



#Item
11Real Analysis Exchange ISSN:Vol. 31(1), , pp. 1–18 G´ abor Kun∗, E¨

Real Analysis Exchange ISSN:Vol. 31(1), , pp. 1–18 G´ abor Kun∗, E¨

Add to Reading List

Source URL: homepages.warwick.ac.uk

Language: English - Date: 2012-01-10 05:32:02
12arXiv:0901.1102v1 [math.PR] 8 JanA CLT for the L2 modulus of continuity of Brownian local time Xia Chen, Wenbo Li, Michael B. Marcus and Jay Rosen∗ February 20, 2013

arXiv:0901.1102v1 [math.PR] 8 JanA CLT for the L2 modulus of continuity of Brownian local time Xia Chen, Wenbo Li, Michael B. Marcus and Jay Rosen∗ February 20, 2013

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2013-02-20 11:10:03
13Effective Uniform Bounds from Proofs in Abstract Functional Analysis Ulrich Kohlenbach Department of Mathematics Darmstadt University of Technology Schlossgartenstraße 7

Effective Uniform Bounds from Proofs in Abstract Functional Analysis Ulrich Kohlenbach Department of Mathematics Darmstadt University of Technology Schlossgartenstraße 7

Add to Reading List

Source URL: www.mathematik.tu-darmstadt.de

Language: English - Date: 2012-08-23 06:38:01
14The use of a logical principle of uniform boundedness in analysis Ulrich Kohlenbach Department of Mathematics University of Michigan Ann Arbor

The use of a logical principle of uniform boundedness in analysis Ulrich Kohlenbach Department of Mathematics University of Michigan Ann Arbor

Add to Reading List

Source URL: www.mathematik.tu-darmstadt.de

Language: English - Date: 2012-11-16 09:33:56
15

PDF Document

Add to Reading List

Source URL: www.mathematik.tu-darmstadt.de

Language: English - Date: 2012-11-16 10:10:51
16Π01 ENCODABILITY AND OMNISCIENT REDUCTIONS BENOIT MONIN AND LUDOVIC PATEY Abstract. A set of integers A is computably encodable if every infinite set of integers has an infinite subset computing A. By a result of Solova

Π01 ENCODABILITY AND OMNISCIENT REDUCTIONS BENOIT MONIN AND LUDOVIC PATEY Abstract. A set of integers A is computably encodable if every infinite set of integers has an infinite subset computing A. By a result of Solova

Add to Reading List

Source URL: ludovicpatey.com

Language: English - Date: 2016-03-08 13:28:28
17A Game on towers David Chodounsk´y Charles University in Prague June 5, 2010

A Game on towers David Chodounsk´y Charles University in Prague June 5, 2010

Add to Reading List

Source URL: spot.colorado.edu

Language: English - Date: 2010-06-05 23:00:07
18Proof mining in L1-approximation  Ulrich Kohlenbach a,1, Paulo Oliva a,1 a Department  of Computer Science, University of Aarhus, DK-8000 Aarhus C,

Proof mining in L1-approximation Ulrich Kohlenbach a,1, Paulo Oliva a,1 a Department of Computer Science, University of Aarhus, DK-8000 Aarhus C,

Add to Reading List

Source URL: www.mathematik.tu-darmstadt.de

Language: English - Date: 2012-11-12 10:33:41
19A SELECTION THEORY FOR MULTIPLE-VALUED FUNCTIONS IN THE SENSE OF ALMGREN JORDAN GOBLET Abstract. A Qk (Rn )-valued function is essentially a rule assigning k unordered and non necessarily distinct elements of Rn to each

A SELECTION THEORY FOR MULTIPLE-VALUED FUNCTIONS IN THE SENSE OF ALMGREN JORDAN GOBLET Abstract. A Qk (Rn )-valued function is essentially a rule assigning k unordered and non necessarily distinct elements of Rn to each

Add to Reading List

Source URL: www.uclouvain.be

Language: English - Date: 2014-02-09 15:34:00
20FLATTENING FUNCTIONS ON FLOWERS EDMUND HARRISS AND OLIVER JENKINSON Abstract. Let T be an orientation-preserving Lipschitz expanding map of the circle T. A pre-image selector is a map τ : T → T with finitely many disc

FLATTENING FUNCTIONS ON FLOWERS EDMUND HARRISS AND OLIVER JENKINSON Abstract. Let T be an orientation-preserving Lipschitz expanding map of the circle T. A pre-image selector is a map τ : T → T with finitely many disc

Add to Reading List

Source URL: www.mathematicians.org.uk

Language: English - Date: 2009-09-28 10:48:11